• Hasse diagram
• Hasse diagrams

Hasse diagram (suomeksi)

Määritelmät:

• (lb, en, set theory) A diagram which represents a finite poset, in which nodes are elements of the poset and arrows represent the order relation between elements. transitivity, Transitivity of the order relation is tacit, in other words, if $x\; \backslash le\; y$ and $y\; \backslash le\; z$ then no arrow is drawn from ''x'' to ''z'', but if there is no distinct ''z'' between ''x'' and ''y'' (such that $x\; \backslash le\; z\; \backslash le\; y$) then an arrow is draw from ''x'' to ''y''.